PRODUCT FRACTAL SETS DETERMINED BY STABLE PROCESSES

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricting isotropic α-stable Lévy processes from R to fractal sets

The restriction of an isotropic α-stable Lévy process Xα in Rn on the fractal support F of certain finite Borel measures μ is introduced in three different ways: by means of the trace of its Dirichlet form on F and related Besov spaces, by its μ-local time on F and the corresponding time changed process, and by restricting on the fine support of μ via balayage spaces and potentials. Moreover, f...

متن کامل

Rough sets determined by tolerances

We show that for any tolerance R on U , the ordered sets of lower and upper rough approximations determined by R form ortholattices. These ortholattices are completely distributive, thus forming atomistic Boolean lattices, if and only if R is induced by an irredundant covering of U , and in such a case, the atoms of these Boolean lattices are described. We prove that the ordered set RS of rough...

متن کامل

Rough Sets Determined by Quasiorders

In this paper, the ordered set of rough sets determined by a quasiorder relation R is investigated. We prove that this ordered set is a complete, completely distributive lattice, whenever the partially ordered set of the equivalence classes of R∩R−1 does not contain infinite ascending chains. We show that on this lattice can be defined three different kinds of complementation operations, and we...

متن کامل

Classifying Cantor Sets by Their Fractal Dimensions

In this article we study Cantor sets defined by monotone sequences, in the sense of Besicovich and Taylor. We classify these Cantor sets in terms of their h-Hausdorff and h-packing measures, for the family of dimension functions h, and characterize this classification in terms of the underlying sequences.

متن کامل

Large simplices determined by finite point sets

Given a set P of n points in R, let d1 > d2 > . . . denote all distinct inter-point distances generated by point pairs in P . It was shown by Schur, Martini, Perles, and Kupitz that there is at most one d-dimensional regular simplex of edge length d1 whose every vertex belongs to P . We extend this result by showing that for any k the number of d-dimensional regular simplices of edge length dk ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 2009

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972708001081